Global optimality conditions for nonconvex minimization problems with quadratic constraints
نویسندگان
چکیده
منابع مشابه
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
We consider nonconvex quadratic optimization problems with binary constraints. Our main result identifies a class of quadratic problems for which a given feasible point is global optimal. We also establish a necessary global optimality condition. These conditions are expressed in a simple way in terms of the problem’s data. We also study the relations between optimal solutions of the nonconvex ...
متن کاملNonconvex Piecewise-Quadratic Underestimation for Global Minimization
Motivated by the fact that important real-life problems, such as the protein docking problem, can be accurately modeled by minimizing a nonconvex piecewise-quadratic function, a nonconvex underestimator is constructed as the minimum of a finite number of strictly convex quadratic functions. The nonconvex underestimator is generated by minimizing a linear function on a reverse convex region and ...
متن کاملSolutions and optimality criteria for nonconvex quadratic-exponential minimization problem
This paper presents a set of complete solutions and optimality conditions for a nonconvex quadratic-exponential optimization problem. By using the canonical duality theory developed by the first author, the nonconvex primal problem in n-dimensional space can be converted into an one-dimensional canonical dual problem with zero duality gap, which can be solved easily to obtain all dual solutions...
متن کاملNecessary Optimality Conditions for Nonconvex Diierential Inclusion with Endpoint Constraints
In this paper, we derive necessary optimality conditions for optimization problems deened by non-convex diierential inclusions with endpoint constraints. We do this in terms of parametrizations of the convexiied form of the diierential inclusion and, under additional assumptions, in terms of the inclusion itself.
متن کاملNecessary and Sufficient Conditions for Optimality of Nonconvex, Noncoercive Autonomous Variational Problems with Constraints
We consider the classical autonomous constrained variational problem of minimization of ∫ b a f(v(t), v ′(t))dt in the class Ω:={v ∈ W 1,1(a, b) : v(a) = α, v(b) = β, v′(t) ≥ 0 a.e. in (a, b)}, where f : [α, β] × [0,+∞) → R is a lower semicontinuous, nonnegative integrand, which can be nonsmooth, nonconvex and noncoercive. We prove a necessary and sufficient condition for the optimality of a tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2015
ISSN: 1029-242X
DOI: 10.1186/s13660-015-0776-3